Local approximation of Markov chains in time and space
نویسندگان
چکیده
منابع مشابه
Approximation of discrete-time polling systems via structured Markov chains
We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic routing is a special case of Markovian routi...
متن کاملApproximation of word counts in Markov chains
In this talk, we give an overview about the diierent approximation results existing on the statistical distribution of word counts in a Markov chain. Results concerning the number of overlapping occurrences, the number of non-overlapping occurrences (renewals) and the declumped count will be presented. Counts of single words but also multiple words and word families are considered. We will see ...
متن کاملApplying Mean-Field Approximation to Continuous Time Markov Chains
The mean-field analysis technique is used to perform analysis of a systems with a large number of components to determine the emergent deterministic behaviour and how this behaviour modifies when its parameters are perturbed. The computer science performance modelling and analysis community has found the mean-field method useful for modelling large-scale computer and communication networks. App...
متن کاملLocal Alignment of Markov Chains
We consider local alignments without gaps of two independent Markov chains from a finite alphabet, and we derive sufficient conditions for the number of essentially different local alignments with a score exceeding a high threshold to be asymptotically Poisson distributed. From the Poisson approximation a Gumbel approximation of the maximal local alignment score is obtained. The results extend ...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Biological Dynamics
سال: 2019
ISSN: 1751-3758,1751-3766
DOI: 10.1080/17513758.2019.1569269